A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free Graphs
نویسندگان
چکیده
منابع مشابه
Improved FPT Algorithms for Weighted Independent Set in Bull-Free Graphs
Very recently, Thomassé, Trotignon and Vuskovic [WG 2014] have given an FPT algorithm for Weighted Independent Set in bull-free graphs parameterized by the weight of the solution, running in time 2 ) · n. In this article we improve this running time to 2 ) ·n. As a byproduct, we also improve the previous Turing-kernel for this problem from O(k) to O(k). Furthermore, for the subclass of bull-fre...
متن کاملParameterized algorithm for weighted independent set problem in bull-free graphs
The maximum stable set problem is NP-hard, even when restricted to triangle-free graphs. In particular, one cannot expect a polynomial time algorithm deciding if a bull-free graph has a stable set of size k, when k is part of the instance. Our main result in this paper is to show the existence of an FPT algorithm when we parameterize the problem by the solution size k. A polynomial kernel is un...
متن کاملIndependent Set in P5-Free Graphs in Polynomial Time
The Independent Set problem is NP-hard in general, however polynomial time algorithms exist for the problem on various specific graph classes. Over the last couple of decades there has been a long sequence of papers exploring the boundary between the NPhard and polynomial time solvable cases. In particular the complexity of Independent Set on P5-free graphs has received significant attention, a...
متن کاملA 9k Kernel for Nonseparating Independent Set in Planar Graphs
We study kernelization (a kind of efficient preprocessing) for NP-hard problems on planar graphs. Our main result is a kernel of size at most 9k vertices for the Planar Maximum Nonseparating Independent Set problem. A direct consequence of this result is that Planar Connected Vertex Cover has no kernel with at most (9/8 − ǫ)k vertices, for any ǫ > 0, assuming P 6= NP. We also show a very simple...
متن کاملWeighted Efficient Domination for $P_6$-Free Graphs in Polynomial Time
In a finite undirected graph G = (V,E), a vertex v ∈ V dominates itself and its neighbors in G. A vertex set D ⊆ V is an efficient dominating set (e.d. for short) of G if every v ∈ V is dominated in G by exactly one vertex of D. The Efficient Domination (ED) problem, which asks for the existence of an e.d. in G, is known to be NP-complete for P7-free graphs but solvable in linear time for P5-fr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2015
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-015-0083-x